Permutation groups and normal subgroups
نویسنده
چکیده
Various descending chains of subgroups of a finite permutation group can be used to define a sequence of 'basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the traditional choice for this purpose, but some combinatorial applications require different kinds of basic groups, such as quasiprimitive groups, that are defined by properties of their normal subgroups. Quasiprimitive groups admit similar analyses to primitive groups, share many of their properties, and have been used successfully, for example to study s-arc transitive graphs. Moreover investigating them has led to new results about finite simple groups. 2000 Mathematics Subject Classification: 20B05, 20B10 20B25, 05C25.
منابع مشابه
Computing maximal subgroups of finite groups
We describe a practical algorithm for computing representatives of the conjugacy classes of maximal subgroups in a finite group, together with details of its implementation for permutation groups in the MAGMA system. We also describe methods for computing complements of normal subgroups and minimal supplements of normal soluble subgroups of finite groups.
متن کاملClassifying fuzzy normal subgroups of finite groups
In this paper a first step in classifying the fuzzy normalsubgroups of a finite group is made. Explicit formulas for thenumber of distinct fuzzy normal subgroups are obtained in theparticular cases of symmetric groups and dihedral groups.
متن کاملCharacterising a family of elusive permutation groups∗
A finite transitive permutation group is said to be elusive if it has no fixed point free elements of prime order. In this paper we show that all elusive groups G = N oG1 with N an elementary abelian minimal normal subgroup and G1 cyclic, can be constructed from transitive subgroups of AGL(1, p2), for p a Mersenne prime, acting on the set of p(p + 1) lines of the affine plane AG(2, p).
متن کاملIntroduction to Abstract Algebra ( Math 113 )
3 Groups 12 3.1 Basic Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.2 Subgroups, Cosets and Lagrange’s Theorem . . . . . . . . . . . . . . . . . . 14 3.3 Finitely Generated Groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.4 Permutation Groups and Group Actions . . . . . . . . . . . . . . . . . . . . 19 3.5 The Oribit-Stabiliser Theorem . ....
متن کاملComputing Subgroups Invariant Under a Set of Automorphisms
When examining the structure of a finite group G, a typical question is the determination of the conjugacy classes of subgroups. For this problem a well-known algorithm – the cyclic extension method (Neubüser 1960, Mnich 1992) – has been in use for over 30 years. For practical purposes this algorithm is limited to groups of size a few thousand. If the subgroup lattice is very thin the possible ...
متن کامل